Nested Queries in Object Bases
نویسندگان
چکیده
Many declarative query languages for object oriented oo databases allow nested subqueries This paper contains the rst algebra which is capable of handling arbitrary nested queries and the rst complete classi cation of oo nested queries and the according unnesting strategies For unnesting a two phase approach is used The rst phase called dependency based optimization transforms queries at the query language level in order to treat common subexpressions and independent subqueries more e ciently The trans formed queries are translated to nested algebraic expressions These entail nested loop evaluation which may be very ine cient Hence the second phase unnests nested algebraic expressions to allow for more e cient evaluation The paper also discusses the di erences between unnesting in the relational and unnesting in the oo context Since the rst phase is rather simple the paper concentrates on the second phase
منابع مشابه
Classification And Optimization of Nested Queries in Object Bases
Many declarative query languages for object-oriented (oo) databases allow nested subqueries. This paper contains a complete classiication of oo nested queries and appropriate unnesting optimization strategies based on algebraic rewriting. We adapt some known relational techniques and introduce new ones that use and are concerned with features speciic to object-oriented queries. In particular, w...
متن کاملNested Queries in Object Bases
[12] W. Kiessling. SQL-like and Quel-like correlation queries with aggregates revisited. 12 representing the result of f applied to the set of elements of e whose attribute a is equal to m. The above equivalence applied to the query yields: Note that the max function can be computed in a single scan (linear time) for max g;m;a;f if f is linear. Also note that an equivalent treatment for min can...
متن کاملOptimization of Nested Queries in a Complex Object Model
Transformation of nested SQL queries into join queries is advantageous because a nested SQL query can be looked upon as a nested-loop join, which is just one of the several join implementations that may be available in a relational DBMS. In join queries, dangling (unmatched) operand tuples are lost, which causes a problem in transforming nested queries having the aggregate function COUNT betwee...
متن کاملOptimization of Object Query Languages
Transformation of nested SQL queries into join queries is advantageous because a nestedSQL query can be looked upon as a nested-loop join, which is just one of the several joinimplementations that may be available in a relational DBMS. In join queries, dangling(unmatched) operand tuples are lost, which causes a problem in transforming nestedqueries having the aggregate funct...
متن کاملQueries over Virtual Nested Objects
We describe a system that allows the easy specification and efficient support of queries specified as a set of attribute/ predicate/value triplets over virtual nested objects constructed from relational databases. For example, the Internet Movie Database (imdb) provides virtual nested objects such as ”movies” (each one containing a movie tuple, multiple actor tuples and more) and ”actors” (cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993